Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method
نویسندگان
چکیده
The OTS/CafeOBJ method is an instance of the proof score approach to systems analysis, which has been mainly devoted by researchers in the OBJ community. We describe some tips on writing proof scores in the OTS/CafeOBJ method and use a mutual exclusion protocol to exemplify the tips. We also argue soundness of proof scores in the OTS/CafeOBJ method.
منابع مشابه
Compositionally Writing Proof Scores of Invariants in the OTS/CafeOBJ Method
Observational transition systems (OTSs) are state machines that can be described as behavioral specifications in CafeOBJ, an algebraic specification language and processor. The OTS/CafeOBJ method uses OTSs and CafeOBJ for systems specification and verification. Simultaneous induction is intensively used to prove that an OTS enjoys invariants in the method. To prove that two state predicates p a...
متن کاملGenerating Test Cases for Invariant Properties from Proof Scores in the OTS/CafeOBJ Method
In the OTS/CafeOBJ method, software specifications are described in CafeOBJ executable formal specification language, and verification is done by giving scripts to the CafeOBJ system. The script is called a proof score. In this study, we propose a test case generator from an OTS/CafeOBJ specification together with a proof score. Our test case generator gives test cases by analyzing the proof sc...
متن کاملFormal Analysis of Workflow Systems with Security Considerations
Security considerations, such as role-based access control (RBAC) mechanism and separation of duty (SoD) constraints, are important and integral to workflow systems. We propose the use of an equation-based method – the OTS/CafeOBJ method to specify workflow systems with such security considerations, and verify some desired safety and liveness properties of workflow systems. Specifically, a work...
متن کاملProof Scores in the OTS/CafeOBJ Method
A way to write proof scores showing that distributed systems have invariant properties in algebraic specification languages is described, which has been devised through several case studies. The way makes it possible to divide a formula stating an invariant property under discussion into reasonably small ones, each of which is proved by writing proof scores individually. This relieves the load ...
متن کاملA study of a tool platform for developing formal specification
Since computer systems are pervasive and have a major impact on society, such systems must be built safely and reliably. One of the existing approaches to this issue is to formally model (the designs of) such systems and formally verify that they have desired properties. Computer systems are often modeled as transition systems. If a computer system can be modeled as a finite transition system, ...
متن کامل